Structured Problems for Modal Satisfiability Testing∗ (Preliminary Report)
نویسندگان
چکیده
We report on ongoing experimental work on evaluating test sets for testing modal satisfiability solvers. Our longterm aim is to understand the difference between the use of structured and of unstructured randomly generated problems. Which parts of the problem space do they explore?
منابع مشابه
A New Method for Testing Decision Procedures in Modal and Terminological Logics
We present a new methodology for testing decision procedures for modal and terminological logics which extends the fixed-clause-length test model, commonly used for propositional satisfiability testing. The new method is easy to implement and to use, and it allows for a statistical control of some important features, e.g., hardness and satisfiability rate, of the formulas generated.
متن کاملConstraint Programming for Modelling and Solving Modal Satisfiability
We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.
متن کاملLocal Search and Modal Logic
Local search techniques have widespread use for solving propositional satisfiability problems. We investigate the use of adaptive local search techniques for model generation problems for modal logics; we focus on the modal logic S5. A local search algorithm extended with an adaptive heuristic is presented and tested on an ensemble of randomly generated problem instances. We briefly discuss the...
متن کاملFinite CSP Solvers for Modal Satisfiability
We present a novel encoding of modal satisfiability problems as Constraint Satisfaction Problems. We allow the domains of the resulting constraints to contain other values than just the Boolean 0 or 1, and add various constraints to reason about these values. This modelling is pivotal to speeding up the performance of our constraint-based procedure for checking modal satisfiability in Constrain...
متن کاملThe Random Modal QBF Test Set
Abstract. We provide an empirical evaluation of one of the main test sets that is currently in use for testing modal satisfiability solvers, viz. the random modal QBF test set. We first discuss some of the background underlying the test set, and then evaluate the test set using criteria set forth by Horrocks, Patel-Schneider, and Sebastiani. We also present some guidelines for the use of the te...
متن کامل